Using mixed-integer programming to solve power grid blackout problems
نویسندگان
چکیده
منابع مشابه
Using mixed-integer programming to solve power grid blackout problems
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused damage. We present computation with networks with up to 600 nodes and 827 edges, and many thousands of damage scenarios. 1 Partially funded by NSF award 0521741.
متن کاملCORC Report TR-2005-07 Using mixed-integer programming to solve power grid blackout problems
We consider optimization problems related to the prevention of large-scale cascading blackouts in power transmission networks subject to multiple scenarios of externally caused damage. We present computation with networks with up to 600 nodes and 827 edges, and many thousands of damage scenarios. 1 Partially funded by NSF award DMI-0521741.
متن کاملSolving zero-one mixed integer programming problems using tabu search
We describe a tabu search (TS) approach for solving general zero-one mixed integer programming (MIP) problems that exploits the extreme point property of zero-one solutions. Specialized choice rules and aspiration criteria are identified for the problems, expressed as functions of integer infeasibility measures and objective function values. The first-level TS mechanisms are then extended with ...
متن کاملSolving Mixed-Integer Programming Problems Using Piecewise Linearization Methods
We present an overview on piecewise linearization methods for MINLPs. This will include the concept of disjunctive constraints, which is necessary to define logarithmic reformulations of the so called disaggregated convex combination method and the convex combination method. For the case of a general univariate quadratic function we also calculate the linearization error and proof that equidist...
متن کاملA Multi Objective Approach to solve Capacitated Vehicle Routing Problems with Time Windows Using Mixed Integer Linear Programming
This paper presents a multi objective approach to solve a Capacitated Vehicle Routing Problem with Time Windows (CVRPTW). The proposed model was implemented and tested in a real life problem of a distribution company “Just in Time Delivery S.A” in Portugal. In this paper we have considered an objective function with two main goals: the first is to minimize the total number of vehicles used in t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Optimization
سال: 2007
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2006.10.007